منابع مشابه
The M/M/1 queue is Bernoulli
The classical output theorem for the M/M/1 queue, due to Burke (1956), states that the departure process from a stationary M/M/1 queue, in equilibrium, has the same law as the arrivals process, that is, it is a Poisson process. In this paper we show that the associated measure-preserving transformation is metrically isomorphic to a two-sided Bernoulli shift. We also discuss some extensions of B...
متن کاملThe M/G/1 Retrial Queue with Bernoulli Schedule
This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed access to the server. We first present the necessary and sufficient c...
متن کاملMULTI Phase M/G/1 Queue with Bernoulli Feedback and
In this paper, a multi phase M/G/1queueing system with Bernoulli feedback where the server takes multiple vacation is considered. All the poisson arrivals with mean arrival rate will demand any of the multi essential services.. The service times of the first essential service are assumed to follow a general distribution Bi(v). After the completion of any of the n services, if the customer is di...
متن کاملImpatient customer queue with Bernoulli schedule vacation interruption
This paper investigates a discrete-time impatient customer queue with Bernoullischedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer’s observation epochs using recursive technique. Cost analysis ...
متن کاملAnalysis of a Two-class Priority Queue with Bernoulli Schedules
A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2008
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm110-1-9